The Complexity of Computing the Density of States
نویسندگان
چکیده
We study the computational difficulty of computing the ground state degeneracy and the density of states for local Hamiltonians. We show that the difficulty of both problems is exactly captured by a class which we call #BQP, which is the counting version of the quantum complexity class QMA. We show that #BQP is not harder than its classical counting counterpart #P, which in turn implies that computing the ground state degeneracy or density of states for classical Hamiltonians is just as hard as it is for quantum Hamiltonians.
منابع مشابه
Autonomous Drug-Encapsulated Nanoparticles: Towards a Novel Non-Invasive Approach to Prevent Atherosclerosis
Introduction This paper proposes the concept of autonomous drug-encapsulated nanoparticle (ADENP) as a novel non-invasive approach to prevent atherosclerosis. ADENP consists of three simple units of sensor, controller (computing), and actuator. The hardware complexity of ADENP is much lower than most of the nanorobots, while the performance is maintained by the synergism in the swarm architectu...
متن کاملFirst principles studies on band structures and density of states of graphite surface oxides
Graphite oxide constitutes carbon network with oxygen atoms both on hexagonal arrangement and the edge sites. Structural and electronic properties for graphite-oxygen complexes have been explored using first-principles total-energy calculations within the local density approximation (LDA). Band structures and density of states for the propose carbon 3D models are reported. A finite energy gap and...
متن کاملInteractional complexity development, interactional demonstrators and interaction density in collaborative and e-collaborative writing modalities
This study aimed at investigating the potential of collaborative and e-collaborative writing modalities in developing interactional complexity, utilization of interactional demonstrators and density of interaction. To this end, 66 Iranian intermediate female English as foreign language learners (EFL) were selected to participate in this study according to their scores on Oxford Placement Test (...
متن کاملFirst principles studies on band structures and density of states of graphite surface oxides
Graphite oxide constitutes carbon network with oxygen atoms both on hexagonal arrangement and the edge sites. Structural and electronic properties for graphite-oxygen complexes have been explored using first-principles total-energy calculations within the local density approximation (LDA). Band structures and density of states for the propose carbon 3D models are reported. A finite energy gap and...
متن کاملSweep Line Algorithm for Convex Hull Revisited
Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...
متن کاملNew Algorithm For Computing Secondary Invariants of Invariant Rings of Monomial Groups
In this paper, a new algorithm for computing secondary invariants of invariant rings of monomial groups is presented. The main idea is to compute simultaneously a truncated SAGBI-G basis and the standard invariants of the ideal generated by the set of primary invariants. The advantage of the presented algorithm lies in the fact that it is well-suited to complexity analysis and very easy to i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011